home *** CD-ROM | disk | FTP | other *** search

---

/ ftp.ee.pdx.edu / 2014.02.ftp.ee.pdx.edu.tar / ftp.ee.pdx.edu / pub / users / Harry / TheoryOfComp / slides / chapter5 / slide 6.jpeg

< prev

next >

Joint Photographic Experts Group Image  |  2012-11-17  |  212KB  |  850x1100  |  16-bit (41,151 colors)

Labels: blind | bulletin board | cabinet | fence | paper | poster | reckoner | road | sand | sidewalk | sky | windowpane
OCR: THE HAL DNIL PROBL EM halt when inout THEOREM THE LANGUAGE M is urina Machine HALTTM Mw7 and M halts on MNDECIDABLE ProOF ssume decidable TMERE TueINc MACHINE THAT DELIDES HALTTM Use build another Turing Ma chine that da ides REDUCE ATM HALTTM But Tm nna CONTRADICTION! HALTING Does given Specific iaput haty WNDECIDABLE Assume THERE TueNc Hhat decides undecidable

---